Studies of Chordal Ring Networks via Double Metric Dimensions
نویسندگان
چکیده
Locating the sources of information spreading in networks including tracking down origins epidemics, rumors social networks, and online computer viruses, has a wide range applications. In many situations, identifying where an epidemic started, or which node network served as source, is crucial. But it can be difficult to determine root outbreak, especially when data are scarce noisy. The goal find source infection by analysing provided only limited number observers, such nodes that indicate they infected. Our investigate least observers should placed, similar how figure out minimal doubly resolving sets network. this paper, we calculate double metric dimension chordal ring C R n 1,3,5 describing their sets.
منابع مشابه
Periodically Regular Chordal Rings are Preferable to Double-Ring Networks
The susceptibility of ring networks to disconnection as a result of one or two node/link failures has led to a number of proposals to increase the robustness of such networks. One class of proposals, discussed primarily in the networking and communication communities, but also advocated for use in parallel and distributed systems, involves the provision of a second ring to improve system throug...
متن کاملThe Optimization of Chordal Ring Networks
This paper deals with the design of multi-(micro)computer interconnection networks modelled by graphs. In particular we concentrate upon the optimization of a new family of such networks that turn out to be a generalization of the well-known Arden and Lee's chordal ring networks. This optimization problem leads to the search for certain 3-regular graphs with minimumdiameter for a given order an...
متن کاملFault-tolerant routings in chordal ring networks
This paper studies routing vulnerability in networks modeled by chordal ring graphs. In a chordal ring graph, the vertices are labeled in Z2n and each even vertex i is adjacent to the vertices i + a, i + b, i + c, where a, b, and c are different odd integers. Our study is based on a geometrical representation that associates to the graph a tile which periodically tessellates the plane. Using th...
متن کاملA Class of Odd-Radix Chordal Ring Networks
An n-node network, with its nodes numbered from – ⎣n/2⎦ to ⎡n/2⎤ – 1, is a chordal ring with chord lengths 1 = s0 < s1 < . . . < sk–1 < n/2 when an arbitrary node j (– ⎣n/2⎦ ≤ j < ⎡n/2⎤) is connected to each of the 2k nodes j ± si mod n (0 ≤ i < k) via an undirected link, where “mod” represents (nearly) symmetric residues in [– ⎣n/2⎦, ⎡n/2⎤ – 1]. We study a class of chordal rings in which the c...
متن کاملAssessment of blocking performance in WDM chordal ring networks
In this paper, we present an assessment of the blocking performance in wavelength routed chordal ring networks. The performance is focused on chord lengths of w = 3, w = N/4, and w = √ N + 3, being N the number of nodes. It is shown that, in a 100-node chordal ring network, the use of the chord length of w = N/4 instead of w = 3 clearly reduces the blocking probability. A reduction of the block...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2022
ISSN: ['1026-7077', '1563-5147', '1024-123X']
DOI: https://doi.org/10.1155/2022/8303242